Quantum versus population dynamics over Cayley graphs

Consider a graph whose vertices are populated by identical objects, together with an algorithm for the time-evolution of number objects placed at each vertices. The discrete dynamics these can be observed and studied using simple inexpensive laboratory settings. There many similarities but also differences between such population quantum particle hopping on same graph. In this work, we show that specific decoration original enables exact mapping models dynamics. As such, over graphs is yet another classical platform simulate effects. Several examples used to demonstrate claim.